0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : run_E %s %d THM 0.12/0.32 % Computer : n021.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1440 0.12/0.32 % WCLimit : 180 0.12/0.32 % DateTime : Thu Jul 4 07:16:09 EDT 2024 0.12/0.33 % CPUTime : 0.19/0.46 Running higher-order theorem proving 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.hqpzuPFgs8/E---3.1_28297.p 27.41/3.94 # Version: 3.2.0-ho 27.41/3.94 # Preprocessing class: HSMSSMSSSSSNHHA. 27.41/3.94 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 27.41/3.94 # Starting full_lambda_6 with 540s (3) cores 27.41/3.94 # Starting post_as_ho1 with 180s (1) cores 27.41/3.94 # Starting lpo6_lambda_fix with 180s (1) cores 27.41/3.94 # Starting ho_unfolding_1 with 180s (1) cores 27.41/3.94 # Starting new_ho_10_unif with 180s (1) cores 27.41/3.94 # Starting ho_unfolding_2 with 180s (1) cores 27.41/3.94 # ho_unfolding_2 with pid 28380 completed with status 0 27.41/3.94 # Result found by ho_unfolding_2 27.41/3.94 # Preprocessing class: HSMSSMSSSSSNHHA. 27.41/3.94 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 27.41/3.94 # Starting full_lambda_6 with 540s (3) cores 27.41/3.94 # Starting post_as_ho1 with 180s (1) cores 27.41/3.94 # Starting lpo6_lambda_fix with 180s (1) cores 27.41/3.94 # Starting ho_unfolding_1 with 180s (1) cores 27.41/3.94 # Starting new_ho_10_unif with 180s (1) cores 27.41/3.94 # Starting ho_unfolding_2 with 180s (1) cores 27.41/3.94 # No SInE strategy applied 27.41/3.94 # Search class: HGHNF-FFSF22-SHHFFSBN 27.41/3.94 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 27.41/3.94 # Starting new_ho_10_unif with 54s (1) cores 27.41/3.94 # new_ho_10_unif with pid 28388 completed with status 0 27.41/3.94 # Result found by new_ho_10_unif 27.41/3.94 # Preprocessing class: HSMSSMSSSSSNHHA. 27.41/3.94 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 27.41/3.94 # Starting full_lambda_6 with 540s (3) cores 27.41/3.94 # Starting post_as_ho1 with 180s (1) cores 27.41/3.94 # Starting lpo6_lambda_fix with 180s (1) cores 27.41/3.94 # Starting ho_unfolding_1 with 180s (1) cores 27.41/3.94 # Starting new_ho_10_unif with 180s (1) cores 27.41/3.94 # Starting ho_unfolding_2 with 180s (1) cores 27.41/3.94 # No SInE strategy applied 27.41/3.94 # Search class: HGHNF-FFSF22-SHHFFSBN 27.41/3.94 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 27.41/3.94 # Starting new_ho_10_unif with 54s (1) cores 27.41/3.94 # Preprocessing time : 0.001 s 27.41/3.94 # Presaturation interreduction done 27.41/3.94 27.41/3.94 # Proof found! 27.41/3.94 # SZS status Theorem 27.41/3.94 # SZS output start CNFRefutation 27.41/3.94 thf(decl_sort1, type, a: $tType). 27.41/3.94 thf(decl_22, type, epred1_0: a > a > $o). 27.41/3.94 thf(decl_23, type, esk1_0: (a > $o) > a). 27.41/3.94 thf(decl_24, type, esk2_2: (a > $o) > a > a). 27.41/3.94 thf(decl_25, type, esk3_0: a > a). 27.41/3.94 thf(cTHM145_B_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a > $o]:(((![X4:a]:(((X1 @ (X2 @ X3) @ X4)<=![X5:a]:(((X1 @ X5 @ X4)<=(X3 @ X5)))))&![X6:a]:(((X3 @ X6)=>(X1 @ X6 @ (X2 @ X3)))))&![X6:a]:(((X1 @ X6 @ (X2 @ X3))<=(X3 @ X6)))))&![X7:a, X8:a, X6:a]:((((X1 @ X8 @ X6)&(X1 @ X7 @ X8))=>(X1 @ X7 @ X6))))=>![X9:a > a]:(((![X7:a, X8:a]:(((X1 @ (X9 @ X7) @ (X9 @ X8))<=(X1 @ X7 @ X8)))&![X7:a, X8:a]:(((X1 @ X7 @ X8)=>(X1 @ (X9 @ X7) @ (X9 @ X8)))))=>?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10)))))))), file('/export/starexec/sandbox2/tmp/tmp.hqpzuPFgs8/E---3.1_28297.p', cTHM145_B_pme)). 27.41/3.94 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X3:a > $o]:(((![X4:a]:((![X5:a]:(((X3 @ X5)=>(X1 @ X5 @ X4)))=>(X1 @ (X2 @ X3) @ X4)))&![X6:a]:(((X3 @ X6)=>(X1 @ X6 @ (X2 @ X3)))))&![X6:a]:(((X3 @ X6)=>(X1 @ X6 @ (X2 @ X3))))))&![X7:a, X8:a, X6:a]:((((X1 @ X8 @ X6)&(X1 @ X7 @ X8))=>(X1 @ X7 @ X6))))=>![X9:a > a]:((![X7:a, X8:a]:(((X1 @ X7 @ X8)=>(X1 @ (X9 @ X7) @ (X9 @ X8))))=>?[X10:a]:(((X1 @ (X9 @ X10) @ X10)&(X1 @ X10 @ (X9 @ X10))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_B_pme])])). 27.41/3.94 thf(c_0_2, negated_conjecture, ![X29:a > $o, X30:a, X32:a, X33:a, X34:a, X35:a, X36:a, X38:a, X39:a, X40:a]:((((((((X29 @ (esk2_2 @ X29 @ X30))|(epred1_0 @ (esk1_0 @ X29) @ X30))&(~(epred1_0 @ (esk2_2 @ X29 @ X30) @ X30)|(epred1_0 @ (esk1_0 @ X29) @ X30)))&(~(X29 @ X32)|(epred1_0 @ X32 @ (esk1_0 @ X29))))&(~(X29 @ X33)|(epred1_0 @ X33 @ (esk1_0 @ X29))))&(~(epred1_0 @ X35 @ X36)|~(epred1_0 @ X34 @ X35)|(epred1_0 @ X34 @ X36)))&((~(epred1_0 @ X38 @ X39)|(epred1_0 @ (esk3_0 @ X38) @ (esk3_0 @ X39)))&(~(epred1_0 @ (esk3_0 @ X40) @ X40)|~(epred1_0 @ X40 @ (esk3_0 @ X40)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 27.41/3.94 thf(c_0_3, negated_conjecture, ![X6:a, X5:a, X4:a]:(((epred1_0 @ X6 @ X5)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X6 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 27.41/3.94 thf(c_0_4, negated_conjecture, ![X3:a > $o, X4:a]:(((X3 @ (esk2_2 @ X3 @ X4))|(epred1_0 @ (esk1_0 @ X3) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 27.41/3.94 thf(c_0_5, negated_conjecture, ![X4:a, X21:a > a, X9:a > a, X5:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (X21 @ Z0)))) @ X4)) @ X5)|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (X21 @ Z0))))) @ X4)|~((epred1_0 @ (X21 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (X21 @ Z0)))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 27.41/3.94 thf(c_0_6, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 27.41/3.94 thf(c_0_7, negated_conjecture, ![X3:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X3))|~((X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 27.41/3.94 thf(c_0_8, negated_conjecture, ![X4:a, X21:a > a, X9:a > a, X5:a]:(((epred1_0 @ (X9 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0)))))) @ X4)|~((epred1_0 @ (X21 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X9 @ Z0) @ (esk3_0 @ (X21 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 27.41/3.94 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 27.41/3.94 thf(c_0_10, negated_conjecture, ![X3:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X3) @ X4)|~((epred1_0 @ (esk2_2 @ X3 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 27.41/3.94 thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 27.41/3.94 thf(c_0_12, negated_conjecture, ![X9:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X9 @ Z0)))))))|~((epred1_0 @ X4 @ (X9 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 27.41/3.94 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 27.41/3.94 thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk3_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk3_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 27.41/3.94 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 27.41/3.94 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 27.41/3.94 # SZS output end CNFRefutation 27.41/3.94 # Parsed axioms : 2 27.41/3.94 # Removed by relevancy pruning/SinE : 0 27.41/3.94 # Initial clauses : 8 27.41/3.94 # Removed in clause preprocessing : 1 27.41/3.94 # Initial clauses in saturation : 7 27.41/3.94 # Processed clauses : 949 27.41/3.94 # ...of these trivial : 180 27.41/3.94 # ...subsumed : 244 27.41/3.94 # ...remaining for further processing : 525 27.41/3.94 # Other redundant clauses eliminated : 0 27.41/3.94 # Clauses deleted for lack of memory : 0 27.41/3.94 # Backward-subsumed : 44 27.41/3.94 # Backward-rewritten : 60 27.41/3.94 # Generated clauses : 55366 27.41/3.94 # ...of the previous two non-redundant : 50265 27.41/3.94 # ...aggressively subsumed : 0 27.41/3.94 # Contextual simplify-reflections : 1 27.41/3.94 # Paramodulations : 55199 27.41/3.94 # Factorizations : 166 27.41/3.94 # NegExts : 0 27.41/3.94 # Equation resolutions : 1 27.41/3.94 # Disequality decompositions : 0 27.41/3.94 # Total rewrite steps : 5576 27.41/3.94 # ...of those cached : 4641 27.41/3.94 # Propositional unsat checks : 0 27.41/3.94 # Propositional check models : 0 27.41/3.94 # Propositional check unsatisfiable : 0 27.41/3.94 # Propositional clauses : 0 27.41/3.94 # Propositional clauses after purity: 0 27.41/3.94 # Propositional unsat core size : 0 27.41/3.94 # Propositional preprocessing time : 0.000 27.41/3.94 # Propositional encoding time : 0.000 27.41/3.94 # Propositional solver time : 0.000 27.41/3.94 # Success case prop preproc time : 0.000 27.41/3.94 # Success case prop encoding time : 0.000 27.41/3.94 # Success case prop solver time : 0.000 27.41/3.94 # Current number of processed clauses : 415 27.41/3.94 # Positive orientable unit clauses : 78 27.41/3.94 # Positive unorientable unit clauses: 0 27.41/3.94 # Negative unit clauses : 15 27.41/3.94 # Non-unit-clauses : 322 27.41/3.94 # Current number of unprocessed clauses: 48803 27.41/3.94 # ...number of literals in the above : 153210 27.41/3.94 # Current number of archived formulas : 0 27.41/3.94 # Current number of archived clauses : 110 27.41/3.94 # Clause-clause subsumption calls (NU) : 14415 27.41/3.94 # Rec. Clause-clause subsumption calls : 12180 27.41/3.94 # Non-unit clause-clause subsumptions : 276 27.41/3.94 # Unit Clause-clause subsumption calls : 2009 27.41/3.94 # Rewrite failures with RHS unbound : 0 27.41/3.94 # BW rewrite match attempts : 1984 27.41/3.94 # BW rewrite match successes : 64 27.41/3.94 # Condensation attempts : 949 27.41/3.94 # Condensation successes : 4 27.41/3.94 # Termbank termtop insertions : 12787158 27.41/3.94 # Search garbage collected termcells : 433 27.41/3.94 27.41/3.94 # ------------------------------------------------- 27.41/3.94 # User time : 3.192 s 27.41/3.94 # System time : 0.156 s 27.41/3.94 # Total time : 3.348 s 27.41/3.94 # Maximum resident set size: 1872 pages 27.41/3.94 27.41/3.94 # ------------------------------------------------- 27.41/3.94 # User time : 3.193 s 27.41/3.94 # System time : 0.159 s 27.41/3.94 # Total time : 3.352 s 27.41/3.94 # Maximum resident set size: 1728 pages 27.41/3.94 % E---3.1 exiting 27.41/3.94 % E exiting 27.41/3.94 EOF